/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool evaluateTree(TreeNode* root) {
        if (root->left == nullptr && root->right == nullptr)
            return root->val;
        return dfs(root)->val;
    }

    TreeNode* dfs(TreeNode* root)
    {
        if (root->left == nullptr && root->right == nullptr)
            return root;
        TreeNode* l = dfs(root->left);
        TreeNode* r = dfs(root->right);

        if (root->val == 2)
            root->val = (l->val | r->val);
        else
            root->val = (l->val & r->val);
        return root;
    }
};